Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
نویسندگان
چکیده
New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders per job scheduling problem in the context of a 2-machine flowshop. A lower bound for the makespan performance measure is provided. An optimization model is presented that addresses both job formation and job sequencing.
منابع مشابه
Minimizing Makespan with Multiple Orders per Job in a Two Machine Flowshop with Item Processing
New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders...
متن کاملHeuristics for a two-machine permutation flowshop with limited queue time constraint and arrival times in a semiconductor manufacturing line
In this research, we suggest some modified versions of existing heuristic algorithms for a two-machine flowshop scheduling problem, in which the each job has to be started on the second operation on the second machine within its assigned limited queue time after its first operation is completed on the first machine. The objective function of this scheduling problem is minimizing makespan. In ad...
متن کاملA review of exact solution methods for the non-preemptive multiprocessor flowshop problem
The hybrid or flexible flowshop problem is a generalization of the flowshop in such a way that every job can be processed by one among several machines on each machine stage. In recent years a number of effective exact methods have been developed. A major reason for this progress is the development of new job and machine based lower bounds as well as the rapidly increasing importance of constra...
متن کاملMinimizing makespan on a two-machine re-entrant flowshop
This paper focuses on a two-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1, machine 2 and then machine 1 and machine 2. We develop dominance properties, lower bounds and heuristic algorithms for the problem, a...
متن کاملTwo-machine flowshop scheduling with flexible operations and controllable processing times
TWO-MACHINE FLOWSHOP SCHEDULING WITH FLEXIBLE OPERATIONS AND CONTROLLABLE PROCESSING TIMES Zeynep Uruk M.S. in Industrial Engineering Advisor: Prof. Dr. Selim Aktürk Co-Advisor: Asst. Prof. Dr. Hakan Gültekin August, 2011 In this study, we consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 182 شماره
صفحات -
تاریخ انتشار 2007